Evolutionary Planning in Latent Space

نویسندگان

چکیده

Planning is a powerful approach to reinforcement learning with several desirable properties such as sampling efficiency. However, it requires world model, which not readily available in many real-life problems. In this paper, we propose learn model that enables Evolutionary Latent Space (EPLS). We use Variational Auto Encoder (VAE) compressed latent representation of individual observations and extend Mixture Density Recurrent Neural Network (MDRNN) stochastic, multi-modal forward the used for planning. Random Mutation Hill Climbing (RMHC) algorithm find sequence actions maximize expected reward learned world. demonstrate how build by bootstrapping rollouts from random policy iteratively refining an increasingly accurate planning using model. After few iterations, our agents exceed standard model-free approaches, demonstrates viability approach. Code reproduce experiments at https://github.com/two2tee/WorldModelPlanning videos https://youtu.be/3M39QgeF27U.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space Layout Planning using an Evolutionary Approach1

This paper describes a design method based on constructing a genetic/evolutionarydesign model whose idea is borrowed from natural genetics. Two major issues from the modelling involve how to represent design knowledge for the evolutionary design model and the usefulness of the model for design problems. For the representation of design knowledge in the model, a schema concept is introduced. The...

متن کامل

Space-Efficient Latent Contracts

Standard higher-order contract monitoring breaks tail recursion and leads to space leaks that can change a program’s asymptotic complexity; space-efficiency restores tail recursion and bounds the amount of space used by contracts. Space-efficient contract monitoring for contracts enforcing simple type disciplines (a/k/a gradual typing) is well studied. Prior work establishes a space-efficient s...

متن کامل

Classical Planning in Deep Latent Space: Bridging the Subsymbolic-Symbolic Boundary

Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck. Meanwhile, although deep learning has achieved significant success in many fields, the knowledge is encoded in a subsymbolic representation which is incompatible with symbolic systems such as planners. We propose LatPlan, an unsuper...

متن کامل

Classical Planning in Deep Latent Space: From Unlabeled Images to PDDL (and back)

Current domain-independent, classical planners require symbolic models of the problem domain and instance as input, resulting in a knowledge acquisition bottleneck. Meanwhile, although recent work in deep learning has achieved impressive results in many fields, the knowledge is encoded in a subsymbolic representation which cannot be directly used by symbolic systems such as planners. We propose...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Lecture Notes in Computer Science

سال: 2021

ISSN: ['1611-3349', '0302-9743']

DOI: https://doi.org/10.1007/978-3-030-72699-7_33